Surfel Based Geometry Reconstruction

نویسندگان

  • Vedrana Andersen Dahl
  • Henrik Aanæs
  • Jakob Andreas Bærentzen
چکیده

We propose a method for retrieving a piecewise smooth surface from noisy data. In data acquired by a scanning process sampled points are almost never on the discontinuities making reconstruction of surfaces with sharp features difficult. Our method is based on a Markov Random Field (MRF) formulation of a surface prior, with the surface represented as a collection of small planar patches, the surfels, associated with each data point. The main advantage of using surfels is that we avoid treating data points as vertices. MRF formulation of the surface prior allows us to separately model the likelihood (related to the mesh formation process) and the local surface properties. We chose to model the smoothness by considering two terms: the parallelism between neighboring surfels, and their overlap. We have demonstrated the feasibility of this approach on both synthetical and scanned data. In both cases sharp features were precisely located and planar regions smoothed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

3d Complex Curved Surface Reconstruction of Discrete Point Cloud Based on Surfels

A Surfels 3D reconstruction method based on improved KD-Tree is put forward, firstly collecting the discrete point cloud data through RGB-D camera, replacing the circular or oval surfel model with hexagonal model for modeling and determining the surfel radius in light of neighborhood distribution of sample points; Moreover, doing inside and outside relations test between one point model and ano...

متن کامل

Geodesics for Point Based Model Processing

In this thesis we present a framework for analysis and processing of point set surfaces based on geodesics. The first part deals with computing geodesics on point set surfaces. Two main techniques are presented. The first technique efficiently computes fast approximations of geodesics. It relies on a graph representation of the surface using an extended sphere of influence graph (eSIG). Approxi...

متن کامل

GPU-friendly multi-view stereo reconstruction using surfel representation and graph cuts

In this paper, we present a new surfel (surface element) based multi-view stereo algorithm that runs entirely on GPU. We utilize the flexibility of surfel-based 3D shape representation and global optimization by graph cuts in the same framework. Unlike previous works, the algorithm is optimized to massive parallel processing on GPU. First, we construct surfel candidates by local stereo matching...

متن کامل

Hardware-Accelerated Geometry Instancing for Surfel and Voxel Rendering of Scanned 4D Media

Range scanners based on camera-projector setups permit capturing dynamic objects at high frame rates at affordable costs, producing a time-varying set of points. This paper establishes a 4D media framework for acquiring, compressing and displaying these point clouds, albeit with more emphasis on the rendering aspects. Displaying these point clouds requires techniques capable of alleviating irre...

متن کامل

Compression of textured surfaces represented as surfel sets

A method for lossy compression of genus-0 surfaces is presented. Geometry, texture and other surface attributes are incorporated in a unified manner. The input surfaces are represented by surfels (surface elements), i.e., by a set of disks with attributes. Each surfel, with its attribute vector, is optimally mapped onto a sphere in the sense of geodesic distance preservation. The resulting sphe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010